Given an integern, return the number of trailing zeroes inn!.

Example 1:

Input:
 3

Output:
 0

Explanation:
 3! = 6, no trailing zero.

Example 2:

Input:
 5

Output:
 1

Explanation:
 5! = 120, one trailing zero.

Note:Your solution should be in logarithmic time complexity.

class Solution {

public:

int trailingZeroes\(int n\) {

    int temp=n; int count=0;int result=0;

    while\(temp>0\){

        temp/=5;

        result+=temp;



    }



    return result;

}

};